Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
نویسندگان
چکیده
منابع مشابه
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
We consider a setting where we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp , p = {p1, . . . , pn}, where the cost of (Ri, Rj) ∈ E is the distance between pi and pj . The Shortest Path Problem with Neighborhoods asks, for given Rs and Rt, to find a placement p ...
متن کاملImproved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids
We give improved lower bounds on the link length of spanning paths in a d-dimensional grid of size n. Kranakis et al. conjectured that the optimal link length is (1 + 1 d?1)n d?1 , but gave lower bounds not substantially larger than n d?1 ; we give a lower bound of (1 + 1 2d)n d?1 for all d > 2.
متن کاملeCOMPASS – TR – 046 Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
We study the geometric shortest path and the minimum spanning tree problem with neighborhoods in the L1 metric. In this setting, we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp, p = {p1, . . . , pn}, where the cost of an edge is the distance between the points....
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملFast Optimal Algorithms for the Minimum Rectilinear Steiner Arborescence Problem
| In this paper, we present two optimal algorithms for solving the Minimum Rectilinear Steiner Arborescence (MRSA) Problem. The rst algorithm is a recursive branch-and-bound variant of the RSA heuristic by Rao et al. [14]. The second algorithm uses dynamic programming to avoid solving the same subproblemmore than once. Furthermore, both algorithms can be generalized to solve the All-Quadrant MR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.07.021